TSTP Solution File: NUM695^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM695^4 : TPTP v8.1.2. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:56:19 EDT 2024
% Result : Theorem 0.43s 0.71s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 30
% Syntax : Number of formulae : 57 ( 30 unt; 17 typ; 0 def)
% Number of atoms : 128 ( 44 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 190 ( 32 ~; 8 |; 2 &; 116 @)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 50 ( 50 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 5 con; 0-3 aty)
% Number of variables : 82 ( 64 ^ 18 !; 0 ?; 82 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_23,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_25,type,
in: $i > $i > $o ).
thf(decl_47,type,
ordsucc: $i > $i ).
thf(decl_61,type,
imp: $o > $o > $o ).
thf(decl_62,type,
d_not: $o > $o ).
thf(decl_71,type,
non: $i > ( $i > $o ) > $i > $o ).
thf(decl_72,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_77,type,
e_is: $i > $i > $i > $o ).
thf(decl_123,type,
nat: $i ).
thf(decl_124,type,
n_is: $i > $i > $o ).
thf(decl_127,type,
n_some: ( $i > $o ) > $o ).
thf(decl_130,type,
n_1: $i ).
thf(decl_142,type,
n_pl: $i > $i > $i ).
thf(decl_147,type,
diffprop: $i > $i > $i > $o ).
thf(decl_148,type,
d_29_ii: $i > $i > $o ).
thf(decl_246,type,
esk90_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_imp) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_is_of) ).
thf(def_non,axiom,
( non
= ( ^ [X1: $i,X2: $i > $o,X4: $i] : ( d_not @ ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_non) ).
thf(def_l_some,axiom,
( l_some
= ( ^ [X1: $i,X2: $i > $o] :
( d_not
@ ( all_of
@ ^ [X4: $i] : ( in @ X4 @ X1 )
@ ( non @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_l_some) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_e_is) ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_n_is) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_d_29_ii) ).
thf(def_n_some,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X495: $i] :
( ( in @ X495 @ nat )
=> ( ( Z0 @ X495 )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',def_n_some) ).
thf(satz24b,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( d_29_ii @ ( ordsucc @ X1 ) @ n_1 ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',satz24b) ).
thf(satz4g,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( n_is @ ( ordsucc @ X1 ) @ ( n_pl @ n_1 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p',satz4g) ).
thf(c_0_13,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_14,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_15,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_16,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_17,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_non]) ).
thf(c_0_18,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X468: $i] :
( ( in @ X468 @ Z0 )
=> ( ( Z1 @ X468 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_l_some]) ).
thf(c_0_20,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_21,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_22,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_23,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X468: $i] :
( ( in @ X468 @ Z0 )
=> ( ( Z1 @ X468 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_20]),c_0_18]),c_0_21]) ).
thf(c_0_24,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_25,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_22]) ).
thf(c_0_26,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X506: $i] :
( ( in @ X506 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X506 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_27,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X495: $i] :
( ( in @ X495 @ nat )
=> ( ( Z0 @ X495 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[def_n_some,c_0_23]) ).
thf(c_0_28,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_29,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X506: $i] :
( ( in @ X506 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X506 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
thf(c_0_30,negated_conjecture,
~ ! [X911: $i] :
( ( in @ X911 @ nat )
=> ( ! [X910: $i] :
( ( in @ X910 @ nat )
=> ( ( ( ordsucc @ X911 )
= ( n_pl @ n_1 @ X910 ) )
=> ~ $true ) )
=> ~ $true ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz24b])]),c_0_20]),c_0_29]) ).
thf(c_0_31,negated_conjecture,
! [X1693: $i] :
( ( in @ esk90_0 @ nat )
& ( ~ ( in @ X1693 @ nat )
| ( ( ordsucc @ esk90_0 )
!= ( n_pl @ n_1 @ X1693 ) )
| ~ $true )
& $true ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])])]) ).
thf(c_0_32,plain,
! [X616: $i] :
( ( in @ X616 @ nat )
=> ( ( ordsucc @ X616 )
= ( n_pl @ n_1 @ X616 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4g]),c_0_20]),c_0_25]) ).
thf(c_0_33,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ nat )
| ( ( ordsucc @ esk90_0 )
!= ( n_pl @ n_1 @ X1 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_34,plain,
! [X1386: $i] :
( ~ ( in @ X1386 @ nat )
| ( ( ordsucc @ X1386 )
= ( n_pl @ n_1 @ X1386 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])]) ).
thf(c_0_35,negated_conjecture,
! [X1: $i] :
( ( ( ordsucc @ esk90_0 )
!= ( n_pl @ n_1 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_33]) ).
thf(c_0_36,plain,
! [X1: $i] :
( ( ( ordsucc @ X1 )
= ( n_pl @ n_1 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_37,negated_conjecture,
in @ esk90_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_38,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ n_1 @ esk90_0 )
!= ( n_pl @ n_1 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
thf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.17 % Problem : NUM695^4 : TPTP v8.1.2. Released v7.1.0.
% 0.19/0.18 % Command : run_E %s %d THM
% 0.19/0.39 % Computer : n004.cluster.edu
% 0.19/0.39 % Model : x86_64 x86_64
% 0.19/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.39 % Memory : 8042.1875MB
% 0.19/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.39 % CPULimit : 300
% 0.19/0.39 % WCLimit : 300
% 0.19/0.39 % DateTime : Fri May 3 09:15:33 EDT 2024
% 0.19/0.40 % CPUTime :
% 0.41/0.57 Running higher-order theorem proving
% 0.41/0.57 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.f9UqvmjJYP/E---3.1_13733.p
% 0.43/0.71 # Version: 3.1.0-ho
% 0.43/0.71 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.43/0.71 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.71 # Starting lpo1_fix with 900s (3) cores
% 0.43/0.71 # Starting full_lambda_9 with 300s (1) cores
% 0.43/0.71 # Starting almost_fo_4 with 300s (1) cores
% 0.43/0.71 # Starting new_ho_9 with 300s (1) cores
% 0.43/0.71 # Starting pre_casc_4 with 300s (1) cores
% 0.43/0.71 # Starting ho_unfolding_6 with 300s (1) cores
% 0.43/0.71 # lpo1_fix with pid 13811 completed with status 0
% 0.43/0.71 # Result found by lpo1_fix
% 0.43/0.71 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.43/0.71 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.71 # Starting lpo1_fix with 900s (3) cores
% 0.43/0.71 # No SInE strategy applied
% 0.43/0.71 # Search class: HGHSM-FSLM32-MHSMMSBN
% 0.43/0.71 # Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 0.43/0.71 # Starting full_lambda_5 with 82s (1) cores
% 0.43/0.71 # Starting new_ho_6 with 82s (1) cores
% 0.43/0.71 # Starting pre_casc_4 with 82s (1) cores
% 0.43/0.71 # new_ho_6 with pid 13821 completed with status 0
% 0.43/0.71 # Result found by new_ho_6
% 0.43/0.71 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.43/0.71 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.71 # Starting lpo1_fix with 900s (3) cores
% 0.43/0.71 # No SInE strategy applied
% 0.43/0.71 # Search class: HGHSM-FSLM32-MHSMMSBN
% 0.43/0.71 # Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 0.43/0.71 # Starting full_lambda_5 with 82s (1) cores
% 0.43/0.71 # Starting new_ho_6 with 82s (1) cores
% 0.43/0.71 # Preprocessing time : 0.011 s
% 0.43/0.71
% 0.43/0.71 # Proof found!
% 0.43/0.71 # SZS status Theorem
% 0.43/0.71 # SZS output start CNFRefutation
% See solution above
% 0.43/0.71 # Parsed axioms : 399
% 0.43/0.71 # Removed by relevancy pruning/SinE : 0
% 0.43/0.71 # Initial clauses : 1165
% 0.43/0.71 # Removed in clause preprocessing : 718
% 0.43/0.71 # Initial clauses in saturation : 447
% 0.43/0.71 # Processed clauses : 109
% 0.43/0.71 # ...of these trivial : 3
% 0.43/0.71 # ...subsumed : 28
% 0.43/0.71 # ...remaining for further processing : 78
% 0.43/0.71 # Other redundant clauses eliminated : 2
% 0.43/0.71 # Clauses deleted for lack of memory : 0
% 0.43/0.71 # Backward-subsumed : 0
% 0.43/0.71 # Backward-rewritten : 0
% 0.43/0.71 # Generated clauses : 88
% 0.43/0.71 # ...of the previous two non-redundant : 74
% 0.43/0.71 # ...aggressively subsumed : 0
% 0.43/0.71 # Contextual simplify-reflections : 0
% 0.43/0.71 # Paramodulations : 72
% 0.43/0.71 # Factorizations : 0
% 0.43/0.71 # NegExts : 0
% 0.43/0.71 # Equation resolutions : 6
% 0.43/0.71 # Disequality decompositions : 0
% 0.43/0.71 # Total rewrite steps : 26
% 0.43/0.71 # ...of those cached : 20
% 0.43/0.71 # Propositional unsat checks : 0
% 0.43/0.71 # Propositional check models : 0
% 0.43/0.71 # Propositional check unsatisfiable : 0
% 0.43/0.71 # Propositional clauses : 0
% 0.43/0.71 # Propositional clauses after purity: 0
% 0.43/0.71 # Propositional unsat core size : 0
% 0.43/0.71 # Propositional preprocessing time : 0.000
% 0.43/0.71 # Propositional encoding time : 0.000
% 0.43/0.71 # Propositional solver time : 0.000
% 0.43/0.71 # Success case prop preproc time : 0.000
% 0.43/0.71 # Success case prop encoding time : 0.000
% 0.43/0.71 # Success case prop solver time : 0.000
% 0.43/0.71 # Current number of processed clauses : 78
% 0.43/0.71 # Positive orientable unit clauses : 32
% 0.43/0.71 # Positive unorientable unit clauses: 0
% 0.43/0.71 # Negative unit clauses : 6
% 0.43/0.71 # Non-unit-clauses : 40
% 0.43/0.71 # Current number of unprocessed clauses: 412
% 0.43/0.71 # ...number of literals in the above : 1747
% 0.43/0.71 # Current number of archived formulas : 0
% 0.43/0.71 # Current number of archived clauses : 0
% 0.43/0.71 # Clause-clause subsumption calls (NU) : 353
% 0.43/0.71 # Rec. Clause-clause subsumption calls : 311
% 0.43/0.71 # Non-unit clause-clause subsumptions : 17
% 0.43/0.71 # Unit Clause-clause subsumption calls : 91
% 0.43/0.71 # Rewrite failures with RHS unbound : 0
% 0.43/0.71 # BW rewrite match attempts : 1
% 0.43/0.71 # BW rewrite match successes : 0
% 0.43/0.71 # Condensation attempts : 109
% 0.43/0.71 # Condensation successes : 0
% 0.43/0.71 # Termbank termtop insertions : 117579
% 0.43/0.71 # Search garbage collected termcells : 47175
% 0.43/0.71
% 0.43/0.71 # -------------------------------------------------
% 0.43/0.71 # User time : 0.099 s
% 0.43/0.71 # System time : 0.015 s
% 0.43/0.71 # Total time : 0.114 s
% 0.43/0.71 # Maximum resident set size: 8588 pages
% 0.43/0.71
% 0.43/0.71 # -------------------------------------------------
% 0.43/0.71 # User time : 0.135 s
% 0.43/0.71 # System time : 0.029 s
% 0.43/0.71 # Total time : 0.164 s
% 0.43/0.71 # Maximum resident set size: 2380 pages
% 0.43/0.71 % E---3.1 exiting
% 0.43/0.71 % E exiting
%------------------------------------------------------------------------------